Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
نویسندگان
چکیده
منابع مشابه
On the linear convergence of distributed optimization over directed graphs
This paper develops a fast distributed algorithm, termed DEXTRA, to solve the optimization problem when n agents reach agreement and collaboratively minimize the sum of their local objective functions over the network, where the communication between the agents is described by a directed graph. Existing algorithms solve the problem restricted to directed graphs with convergence rates of O(ln k/...
متن کاملAsymptotics for the infinite time ruin probability of a dependent risk model with a constant interest rate and dominatedly varying-tailed claim sizes
This paper mainly considers a nonstandard risk model with a constant interest rate, where both the claim sizes and the inter-arrival times follow some certain dependence structures. When the claim sizes are dominatedly varying-tailed, asymptotics for the infinite time ruin probability of the above dependent risk model have been given.
متن کاملA Multi-objective optimization model for project scheduling with time-varying resource requirements and capacities
Proper and realistic scheduling is an important factor of success for every project. In reality, project scheduling often involves several objectives that must be realized simultaneously, and faces numerous uncertainties that may undermine the integrity of the devised schedule. Thus, the manner of dealing with such uncertainties is of particular importance for effective planning. A realistic sc...
متن کاملOn Convergence Rate of Distributed Consensus for Homogeneous Graphs
We propose a new criteria called normalized eigenvalue variance as the measure of the convergence rate of a large scale network system with consensus. It permits an assessment of the convergence performance of an important class of systems whose graphs are homogeneous. We propose a design method of the feedback gains to minimize the proposed index. Furthermore, numerical examples exhibits its e...
متن کاملA distributed optimization algorithm with convergence rate O ( 1 k 2 ) for distributed model predictive control ∗
We propose a distributed optimization algorithm for mixedL1/L2-norm optimization based on accelerated gradient methods using dual decomposition. The algorithm achieves convergence rate O( 1 k ), where k is the iteration number, which significantly improves the convergence rates of existing duality-based distributed optimization algorithms that achieve O( 1 k ). The performance of the developed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2018
ISSN: 0020-0255
DOI: 10.1016/j.ins.2017.09.038